Comparing LP Bounds for Queueing Networks
نویسندگان
چکیده
منابع مشابه
Bounds and error bounds for queueing networks
Queueing networks are an important means to model and evaluate a variety of practical systems. Unfortunately, analytic results are often not available. Numerical computation may then have to be employed. Or, system modifications might be suggested to obtain simple bounds or computationally easy approximations. Formal analytic support for the accuaracy or nature of such modifications or approxim...
متن کاملPerformance Bounds and Differential Cost Approximations for Queueing Networks
A new bound is proposed relating the average cost sub-optimality of a myopic policy to its differential cost error. The bound is an expectation over the stationary distribution for this policy. For small queueing networks, we compute or approximate the distribution using the matrix analytic method and numerically test the bound. Product form approximations to the stationary distribution are als...
متن کاملPerformance bounds for feedforward queueing networks with upper-constrained inputs
We propose a simple framework for analyzing feedforward queueing networks that have the following features: each customer belongs to a (customer) flow and the route that a customer follows in the network depends on the flow to which he belongs. The amount of traffic fed by a customer flow into the network is bounded by a deterministic subadditive function, which is called a subadditive envelope...
متن کاملSimple Product-Form Bounds for Queueing Networks with Finite Clusters
Queueing networks are studied with finite capacity constraints for clusters of stations. First, by an instructive tandem cluster example it is shown how a product-form modification method for networks with finite stations can be extended to networks with finite clusters. Next, a general result is established by which networks with finite clusters can be studied at cluster level by merely keepin...
متن کاملNetwork Calculus Delay Bounds in Queueing Networks with Exact Solutions
The purpose of this paper is to shed light on the accuracy of probabilistic delay bounds obtained with network calculus. In particular, by comparing calculus bounds with exact results in a series of M/M/1 queues with cross traffic, we show that reasonably accurate bounds are achieved when the percentage of cross traffic is low. We use recent results in network calculus and, in addition, propose...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2009
ISSN: 0018-9286,1558-2523
DOI: 10.1109/tac.2009.2031582